LOGIC MAY BE SIMPLE Logic, Congruence and Algebra
نویسنده
چکیده
This paper is an attempt to clear some philosophical questions about the nature of logic by setting up a mathematical framework. The notion of congruence in logic is defined. A logical structure in which there is no non-trivial congruence relation, like some paraconsistent logics, is called simple. The relations between simplicity, the replacement theorem and algebraization of logic are studied (including MacLane-Curry’s theorem and a discussion about Curry’s algebras). We also examine how these concepts are related to such notions as semantics, truth-functionality and bivalence. We argue that a logic, which is simple, can deserve the name logic and that the opposite view is connected with a reductionist perspective (reduction of logic to algebra).
منابع مشابه
Evaluation trees for proposition algebra
Proposition algebra is based on Hoare’s conditional connective, which is a ternary connective comparable to if-then-else and used in the setting of propositional logic. Conditional statements are provided with a simple semantics that is based on evaluation trees and that characterizes so-called free valuation congruence: two conditional statements are free valuation congruent if, and only if, t...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملEvaluation Trees for Proposition Algebra - The Case for Free and Repetition-Proof Valuation Congruence
Proposition algebra is based on Hoare’s conditional connective, which is a ternary connective comparable to if-then-else and used in the setting of propositional logic. Conditional statements are provided with a simple semantics that is based on evaluation trees and that characterizes so-called free valuation congruence: two conditional statements are free valuation congruent if, and only if, t...
متن کاملOn Everywhere Strongly Logifiable Algebras
We introduce the notion of an everywhere strongly logifiable algebra: a finite non-trivial algebra A such that for every F 2 P(A)r {;, A} the logic determined by the matrix hA, F i is a strongly algebraizable logic with equivalent algebraic semantics the variety generated by A. Then we show that everywhere strongly logifiable algebras belong to the field of universal algebra as well as to the o...
متن کامل